Sequential Computability of a Function. Effective Fine Space and Limiting Recursion

نویسندگان

  • Mariko Yasugi
  • Yoshiki Tsujii
  • Takakazu Mori
چکیده

We consider real sequences in I = [0, 1) and real functions on I . It is first shown that, as for real sequences from I , R-computability (computability with respect to the Euclidean topology) implies “weak Fine-computability.” Using this result, we show that “Fine-sequential computability” and “L∗-sequential computability” are equivalent for effectively locally Fine-continuous functions as well as for Finecontinuous functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Computability of a Function -limiting Recursion versus Effective Uniformity- to the Memory of Marian Boykan Pour-el

The major objective of this article is a refinement of treatments of the mutual relationship between two notions of “sequential computability” of a function which is possibly Euclidean-discontinuous, one using limiting recursion and one using effective uniformity. We also speculate on these methods from a mathematician’s viewpoint.

متن کامل

Sequential computability of a function - diagonal space and limiting recursion - Yoshiki Tsujii

We consider the real sequences in I = [0, 1) and real functions on I. A computability notion with respect to the uniformity {Un}, where Un(x) = [ k 2n , k+1 2n ) if x ∈ [ k 2n , k+1 2n ), will be called D-computability. An R-computable sequence from I will be shown to be approximated by a recursive sequence of rational numbers with a limiting recursive modulus of convergence with respect to {Un...

متن کامل

Sequential Computability of a Function: Diagonal Space and Limiting Recursion

We consider the real sequences in I = [0, 1) and real functions on I . A computability notion with respect to the uniformity {Un}, where Un(x) = [ k 2n , k+1 2n ) if x ∈ [ k 2n , k+1 2n ), will be called Dcomputability. An R-computable sequence from I will be shown to be approximated by a recursive sequence of rational numbers with a limiting recursive modulus of convergence with respect to {Un...

متن کامل

ective uniformity versus limiting recursion in sequential computability of a function

The major objective of this article is a re nement of treatments of the mutual relationship between two notions of sequential computability of a function which is possibly Euclidean discontinuous one using limiting recursion and one using e ective uniformity We also speculate on these methods from a mathematician s viewpoint

متن کامل

Computability and recursion

We consider the informal concept of “computability” or “effective calculability” and twoof the formalisms commonly used to define it, “(Turing) computability” and“(general) recursiveness”. We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2005